Cut-free common knowledge
نویسندگان
چکیده
Starting off from the infinitary system for common knowledge over multi-modal epistemic logic presented in Alberucci and Jäger [1], we apply the finite model property to “finitize” this deductive system. The result is a cut-free, sound and complete sequent calculus for common knowledge.
منابع مشابه
A Cut-free Tableau Calculus for the Logic of Common Knowledge
In this paper we focus on the development of a cut-free finitary tableau calculus with histories for n-agent modal logics with common knowledge (LCK). Thus, we get a proof system where proof-search becomes feasible and we lay the basis for developing a uniform framework for the treatment of the family of logics of common knowledge. Unlike proof calculi based on temporal logics, our calculus giv...
متن کاملAutomatic proof search in logic of justified common knowledge
We consider the logic of justified common knowledge S4n introduced in [Artemov, 2004]. This system captures the notion of justified common knowledge, which is free of some of the deficiencies of the usual common knowledge operator, and yet sufficient for analysis of epistemic problems where common knowledge has been traditionally applied. In particular, S4n enjoys cut-elimination, which opens a...
متن کاملSyntactic Cut-elimination for Common Knowledge
We see a cut-free infinitary sequent system for common knowledge. Its sequents are essentially trees and the inference rules apply deeply inside of these trees. This allows to give a syntactic cut-elimination procedure which yields an upper bound of φ20 on the depth of proofs, where φ is the Veblen function.
متن کاملIntegration of Decision Procedures into High - Order Interactive
INTEGRATION OF DECISION PROCEDURES INTO HIGH-ORDER INTERACTIVE PROVERS by Yegor Bryukhov Adviser: Professor Sergei Artemov An efficient proof assistant uses a wide range of decision procedures, including automatic verification of validity of arithmetical formulas with linear terms. Since the final product of a proof assistant is a formalized and verified proof, it prompts an additional task of ...
متن کاملCut-free Single-pass Tableaux for the Logic of Common Knowledge
We present a cut-free tableau calculus with histories and variables for the EXPTIME-complete multi-modal logic of common knowledge (LCK). Our calculus constructs the tableau using only one pass, so proof-search for testing theoremhood of φ does not exhibit the worst-case EXPTIME-behaviour for all φ as in two-pass methods. Our calculus also does not contain a “finitized ω-rule” so that it detect...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Applied Logic
دوره 5 شماره
صفحات -
تاریخ انتشار 2007